According to the theory of natural movement, street networks interact with pedestrian movement and walkability. In addition to permeability criteria, Visual perception has an impact on pedestrian preferences and behaviors by providing a capacity for understanding and wayfinding. This research aims to investigate the correlation between the Visual and spatial characteristics of the environment in the Jolfa neighborhood of Isfahan city. The set of space syntax tools, including Axial, Isovist, and Visual Graph Analysis, were used to quantify and interpret the configurational and Visual criteria in the historical area of Jolfa. The Spearman correlation coefficient was used to calculate the correlation between both integration and connectivity with isovist area, isovist perimeter, compactness, occlusivity, through-vision, and Visual clustering. The results show that, in addition to integration, connectivity, and intelligibility, Visual properties (i.e., isovist area, isovist perimeter, and occlusivity) had a significant impact on movement patterns in this area. To Validate the results, the agent-based model was used to compare the space syntax simulation of the pedestrian movement with the actual environment. It was shown that Visual features derived from space syntax can predict pedestrian movement in the real world. Visual characteristics are complementary to spatial configuration and can help with spatial perception, wayfinding, and pedestrian movement.

Purpose: The objective of this research is to study and compare the coauthorship Graphs (networks) of Iranian researchers in the main fields of mathematics by using records, extracted from WOS and Google Scholar, and Graph parameters. Methodology: The co-authorship Graphs (networks) of Iranian researchers in 6 specialty fields of mathematics have been drawn by mathematical methods and software. Overall this research, 276 Iranian researchers in mathematics were considered and the co-authorship Graphs in all fields were drawn and compared. Some mathematical Graph parameters such as degrees of vertices, diameter, radius, independence number, vertex and edge chromatic numbers, matching number, for all co-authorship Graphs were calculated too. Finally, we analyze and compare the co-authorship Graphs by using these Graph parameters. Findings: The research findings showed that two specialty fields Operation Research and Graphs and Combinatorics with average degrees 4. 20 and 3. 70, respectively, have high research collaboration with respect to other fields. The greatest diameter in the co-authorship Graph, which equals 8, belongs to Commutative Algebra and the co-authorship Graphs of the specialty field Numerical Analysis and Group Theory have the same least value of radius 3. Conclustion: In some specialty fields of mathematics, which are pure, there is not enough collaboration among Iranian researchers. So, it is better that these researchers try to have more collaboration to publish stronger and deeper research works in the international journals. For this aim, more budget allocations should be considered to accelerate researchers to do group works with high quality.

Chemical Graph theory is a bridge between Chemistry and Graph theory. Graph energies are important tools for QSPR researches. Thus, this study aims to relate several energies with the QSPR Analysis of 67 alkanes. We compare these results with the Maximum Degree Energy, Minimum Degree Energy, and Second Zagreb Energy. Our study reveals some interesting results based on the predicting power of these Graph energies.AMS 2010 codes:  94C15, 92E10.

Environmental education is a major investment for students to become active citizens in the field of environmental protection. The main goal of this research is to investigate the level of students' understanding and attention to issues related to environmental protection. The research method in this qualitative study is the Visual content Analysis method with the content Analysis table tool including 5 main components: optimization of solid waste collection and transportation, optimization of urban waste disposal technology, attention to waste recycling, creation of a culture of less waste production, health education and raising awareness and 25 sub-concepts. This research is applied and descriptive in terms of data collection. By carefully examining the environmental concepts in 19 cases of children's drawings and by searching in research documents, the effective factors on improving the efficiency of waste management were identified and then analyzed. In order to measure the reliability of the content Analysis, the units of Analysis were coded and the researchers agreed on it. The findings show that the most attention and understanding of children regarding environmental teachings is related to the concept of optimizing the collection and transportation of solid waste materials and the least attention is related to the creation of a culture of producing less waste.

Despite several studies and attempts, in time-memory trade-off attacks on cryptoGraphic algorithms, the coverage of Hellman tables and similar methods are practically much less than half and their probability of success is low. In fact, Hellman chains are paths with given starting and end vertices on a functional Graph. In this paper, behavior of these chains is investigated with this approach. In the beginning of the paper, parameters of the functional Graph for a random mapping are defined and based on these parameters, Hellman chains are analyzed. Our results show that the coverage of such tables can’t be high, for the following reasons: First, there exist some remarkable terminal vertices (37%) on the functional Graph such that the possible occurrence of these vertices on chains (except in the starting vertices) is zero. Secondly, appropriate parameters for constructing chains exist in Graph for about half of all hidden states of cipher function. Thirdly, for construction of noncyclic chains and collision of chains, we must pay attention to the obtained probabilities in this note. Practically, above reasons show that after some point the coverage of a Hellman table tends to zero quickly, and so construction of them will be ineffective. Our results are implemented on mAES algorithm where validate our theatrical results.

Background: Autism spectrum disorder is a neurodevelopmental condition in which impaired connectivity of the brain network. The functional magnetic resonance imaging (fMRI) technique can provide information on the early diagnosis of autism by evaluating communication patterns in the brain. The present study aimed to assess functional connectivity (FC) variations in autism patients. Materials and Methods: Resting? state fMRI data were obtained from the “ABIDE” website. These data include 294 autism patients with a mean (standard deviation) age of 16. 49 (7. 63) and 312 healthy individuals with a mean (standard deviation) age of 15. 98 (6. 31). In this study, changes in communication patterns across different brain regions in autism patients were investigated using Graph? based models. Results: The FC cluster of 17 regions in the brain, such as the ippocampus, cuneus, and inferior temporal, was different between the patient and healthy groups. Based on connectivity Analysis of pair regions, 36 of the 136 correlations in the cluster were significantly different between the two groups. The middle temporal gyrus had more communication than the other regions. The largest difference between groups was – 0. 112, which corresponding to the right middle temporal and right thalamus regions. Conclusion: The findings of this study revealed functional relationship alterations in patients with autism compared to healthy individuals, indicating the disease’s effects on the brain connectivity network.

The independence Graph Ind(G) of a Graph G is the Graph with vertices as maximum independent sets of G and two vertices are adjacent, if and only if the corresponding maximum independent sets are disjoint. In this work, we find the independence Graph of Cartesian product of d copies of complete Graphs Kq, which is known as the Hamming Graph H(d, q). Greenwell and Lovasz [7] found that the independence number of direct product of d copies of Kq as qd−1. We prove that the independence number of Hamming Graph H(d, q), which is cartesian product of d copies of Kq, is also qd−1. As an application of our findings, we find answers for rook problem in higher dimensional square chess board.